Approximating Treewidth, Pathwidth, and Minimum Elimination Tree Height
نویسندگان
چکیده
منابع مشابه
Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
Various parameters of graphs connected to sparse matrix factoriza-tion and other applications can be approximated using an algorithm of Leighton et al. that nds vertex separators of graphs. The approximate values of the parameters, which include minimum front size, treewidth, pathwidth, and minimum elimination tree height, are no more than O(logn) (minimum front size and treewidth) and O(log 2 ...
متن کاملISSN 0333-3590 Nondeterministic Graph Searching: From Pathwidth to Treewidth
We introduce nondeterministic graph searching with a controlled amount of nondeterminism and show how this new tool can be used in algorithm design and combinatorial analysis applying to both pathwidth and treewidth. We prove equivalence between this game-theoretic approach and graph decompositions called q-branched tree decompositions, which can be interpreted as a parameterized version of tre...
متن کاملEfficient and Constructive Algorithms
In this paper we give, for all constants k, l, explicit algorithms, that given a graph G = (V, E) with a tree-decomposition of G with treewidth at most l, decide whether the treewidth (or pathwidth) of G is at most k, and if so, find a tree-decomposition or (path-decomposition) of G of width at most k, and that use O(IVD time. In contrast with previous solutions, our algorithms do not rely on n...
متن کاملThe Treewidth of Line Graphs
The treewidth of a graph is an important invariant in structural and algorithmic graph theory. This paper studies the treewidth of line graphs. We show that determining the treewidth of the line graph of a graph G is equivalent to determining the minimum vertex congestion of an embedding of G into a tree. Using this result, we prove sharp lower bounds in terms of both the minimum degree and ave...
متن کاملMemory Requirements for Table Computations in Partial K-tree Algorithms
This paper addresses memory requirement issues arising in implementations of algorithms on graphs of bounded treewidth. Such dynamic programming algorithms require a large data table for each vertex of a tree-decomposition T of the input graph. We give a linear-time algorithm that nds the traversal order of T minimizing the number of tables stored simultaneously. We show that this minimum value...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1991